Morphisms for the Maximum Weight Ideal Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Minimum-weight Ideal Problem for Signed Posets
The concept of signed poset has recently been introduced by V. Reiner as a generalization of that of ordinary poset (partially ordered set). We consider the problem of finding a minimum-weight ideal of a signed poset. We show a representation theorem that there exists a bijection between the set of all the ideals of a signed poset and the set of all the "reduced ideals" (defined here) of the as...
متن کاملThe maximum weight hierarchy matching problem
We study the problem of fusing several reports about a group of objects into a single summary report, which best represents the received reports. A report is a list of labels associated with a group of objects, as reported by some identification device. Reports do not associate which object in the group has been given a specific label, the labels used in each report may be given in various leve...
متن کاملThe Maximum Weight Connected Subgraph Problem
The Maximum (Node-) Weight Connected Subgraph Problem (MWCS) searches for a connected subgraph with maximum total weight in a node-weighted (di)graph. In this work we introduce a new integer linear programming formulation built on node variables only, which uses new constraints based on node-separators. We theoretically compare its strength to previously used MIP models in the literature and st...
متن کاملApproximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
Given a vertex-weighted connected graphG = (V,E), the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree T of G such that the total weight of the internal vertices in T is maximized. The unweighted variant, denoted as MIST, is NPhard and APX-hard, and the currently best approximation algorithm has a proven performance ratio 13/17. The currently best approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2000
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3100